Constrained Probabilistic Search for a One-Dimensional Random Walker
نویسندگان
چکیده
منابع مشابه
Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملSOME PROBABILISTIC INEQUALITIES FOR FUZZY RANDOM VARIABLES
In this paper, the concepts of positive dependence and linearlypositive quadrant dependence are introduced for fuzzy random variables. Also,an inequality is obtained for partial sums of linearly positive quadrant depen-dent fuzzy random variables. Moreover, a weak law of large numbers is estab-lished for linearly positive quadrant dependent fuzzy random variables. Weextend some well known inequ...
متن کاملPSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...
متن کاملHunting a Random Walker on a Low Dimensional Torus
We will define a problem regarding locating a simple random walk on a graph, and give bounds for the optimal solution on toruses of dimension 2,3. 1 Hunting a Random Walker There are several natural variants of the hunting problem, here is one. A bird performs a random walk on a graph. At each step a hunter picks a vertex and either catches the bird or gets to see if the bird visited there befo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Robotics
سال: 2016
ISSN: 1552-3098,1941-0468
DOI: 10.1109/tro.2015.2513751